An approximate Riemann solver for shallow water equations and heat advection in horizontal centrifugal casting
نویسندگان
چکیده
منابع مشابه
An Fgmres Solver for the Shallow Water Equations 3512
The Shallow Water Equations (SWE) are a set of nonlinear hyperbolic equations, describing long waves relative to the water depth. Physical phenomena such as tidal waves in rivers and seas, breaking of waves on shallow beaches and even harbour oscillations can be modelled successfully with the SWE. The 3D SWE (1.1){(1.3) given below for Cartesian (;) coordinates are based on the hydrostatic assu...
متن کاملAn Efficient Fgmres Solver for the Shallow Water Equations
The Shallow Water Equations (SWE) are a set of nonlinear hyperbolic equations, describing long waves relative to the water depth. Physical phenomena such as tidal waves in rivers and seas, breaking of waves on shallow beaches and even harbour oscillations can be modelled successfully with the SWE. The 3D SWE (1.1){(1.3) given below for Cartesian (;) coordinates are based on the hydrostatic assu...
متن کاملAn upwinded state approximate Riemann solver
Stability is achieved in most approximate Riemann solvers through ‘flux upwinding’, where the flux at the interface is arrived at by adding a dissipative term to the average of the left and right flux. Motivated by the existence of a collapsed interface state in the gas-kinetic Bhatnagar–Gross–Krook (BGK) method, an alternative approach to upwinding is attempted here; an interface state is arri...
متن کاملA Fast and Compact Solver for the Shallow Water Equations
This paper presents a fast and simple method for solving the shallow water equations. The water velocity and height variables are collocated on a uniform grid and a novel, unified scheme is used to advect all quantities together. Furthermore, we treat the fluid as weakly compressible to avoid solving a pressure Poisson equation. We sacrifice accuracy and unconditional stability for speed, but w...
متن کاملAn Approximate Solver for Symbolic Equations
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an ini t ial approximat ion by solving for the dominant term in the equation, or if this fails, by bisection. It refines this approximation by a symbolic version of Newton's method. It tests whether the first Newton iterate lies closer to the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2015
ISSN: 0096-3003
DOI: 10.1016/j.amc.2015.04.028